Functional sample path properties of subsequence's C-R increments for a Wiener process in Hlder norm

In this paper, with the aid of large deviation formulas established in strong topology of functional space generated by H¨older norm, we discuss the functional sample path properties of subsequence's C-R increments for a Wiener process in H¨older normThe obtained results,generalize the corresponding results of Chen and the classic Strassen's law of iterated logarithm for a Wiener process.     

On the Lipschitz equivalence of self‐affine sets

Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems.     

On Applications of Quasi-Monotone Sequences and Quasi Power Increasing Sequences

In this article, we prove a general theorem dealing with an application of quasi-f-power increasing sequences and δ-quasi monotone sequences. This theorem also includes some known and new results.     

Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.     

Ends,tangles and critical vertex sets

We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?₀‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel.     

Graph-like compacta: Characterizations and Eulerian loops

A compact graph-like space is a triple $\left(X,V,E\right)$, where $X$ is a compact, metrizable space, $V\subseteq X$ is a closed zero-dimensional subset, and $E$ is an index set such that $X⧹V\cong \text{◂+▸}E\times \left(0,1\right)$. New characterizations of compact graph-like spaces are given, connecting them to certain classes of continua, and to standard subspaces of Freudenthal compactifications of locally finite graphs. These are applied to characterize Eulerian graph-like compacta.